Recovering first order terms from boundary measurements
نویسندگان
چکیده
منابع مشابه
Determining Nonsmooth First Order Terms from Partial Boundary Measurements
We extend results of Dos Santos Ferreira-Kenig-SjöstrandUhlmann (arXiv:math.AP/0601466) to less smooth coefficients, and we show that measurements on part of the boundary for the magnetic Schrödinger operator determine uniquely the magnetic field related to a Hölder continuous potential. We give a similar result for determining a convection term. The proofs involve Carleman estimates, a smoothi...
متن کاملRecovering Robin’s Coefficients from Boundary Measurements
We consider the problem of determining the heat exchange coefficient of some specimen material, by prescribing a flux on some part of the boundary, and measuring the temperature on some other. An identifiability result is proved, for Robin’s coefficients which are continuous functions with some negative lower bound. Both a local and an almost global Lipschitz stability results are established. ...
متن کاملIdentifiability at the boundary for first-order terms
Let Ω be a domain in R whose boundary is C if n ≥ 3 or C if n = 2. We consider a magnetic Schrödinger operator LW,q in Ω and show how to recover the boundary values of the tangential component of the vector potential W from the Dirichlet to Neumann map for LW,q. We also consider a steady state heat equation with convection term ∆+2W ·∇ and recover the boundary values of the convection term W fr...
متن کاملRecovering Surface Shape from Boundary
Humans can r e c o v e r t h e shape o f a s u r f a c e f r o m i t s image b o u n d a r y . The a u t h o r s have p r e s e n t e d a new a p p r o a c h t o shape f r o m b o u n d a r y [ 4 ] . I t i n c l u d e s t h r e e p o i n t s : t h e l i n e o f c u r v a t u r e (LOC) r e g u l a r i t y , a n a l g o r i t h m f o r c o n s t r u c t i n g LOC net f r o m b o u n d a r y , and...
متن کاملFirst-Order Unification on Compressed Terms
Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the sharing of subtrees known from DAGs to sharing of connected subgraphs. This allows to obtain smaller in-memory representations of trees than with DAGs. In the past years some important tree algorithms were proved to perform efficiently (without decompression) over STGs; e.g., type checking, equivalenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2007
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/73/1/012020